Quiver combinatorics and triangulations of cyclic polytopes

نویسندگان

چکیده

Motivated by higher homological algebra, we associate quivers to triangulations of even-dimensional cyclic polytopes and prove two results showing what information about the triangulation is encoded in quiver. We first show that cut Iyama Oppermann correspond precisely 2d-dimensional without interior (d+1)-simplices. This implies these form a connected subgraph flip graph. Our second result shows how quiver can be used identify mutable internal d-simplices. points towards theory higher-dimensional mutation might look like gives new way understanding flips polytopes.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Triangulations of Cyclic Polytopes and Higher Bruhat Orders

Recently EDELMAN & REINER suggested two poset structures S1(n;d) and S2(n;d) on the set of all triangulations of the cyclic dpolytope C(n;d) with n vertices. Both posets are generalizations of the well-studied Tamari lattice. While S2(n;d) is bounded by definition, the same is not obvious for S1(n;d). In the paper by EDELMAN & REINER the bounds of S2(n;d) were also confirmed for S1(n;d) wheneve...

متن کامل

The Combinatorics of Quiver Representations

Contents 1. Introduction 1 1.1. Main results 1 1.2. Horn's conjecture and related problems 2 1.3. The quiver method 4 1.4. Organization 5 2. Preliminaries 6 2.1. Basic notions for quivers 6 2.2. Semi-invariants for quiver representations 7 2.3. Representations in general position 8 2.4. The canonical decomposition 9 2.5. The combinatorics of dimension vectors 11 2.6. Perpendicular categories 12...

متن کامل

Triangulations of Simplicial Polytopes

Various facts about triangulations of simplicial polytopes, particularly those pertaining to the equality case in the generalized lower bound conjecture, are collected together here. They include an apparently weaker restriction on the kind of triangulation which needs to be found, and an inductive argument which reduces the number of cases to be established.

متن کامل

Regular triangulations and resultant polytopes

We describe properties of the Resultant polytope of a given set of polynomial equations towards an outputsensitive algorithm for enumerating its vertices. In principle, one has to consider all regular fine mixed subdivisions of the Minkowski sum of the Newton polytopes of the given equations. By the Cayley trick, this is equivalent to computing all regular triangulations of another point set in...

متن کامل

Math 669: Combinatorics of Polytopes

These are rather condensed notes, not really proofread or edited, presenting key definitions and results of the course that I taught in Winter 2010 term. Problems marked by ◦ are easy and basic, problems marked by ∗ may be difficult. Typeset by AMS-TEX 1

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Algebraic combinatorics

سال: 2023

ISSN: ['2589-5486']

DOI: https://doi.org/10.5802/alco.280